Localization is one of the key technologies in wireless sensor networks (WSNs), since it provides fundamental support for many\nlocation-aware protocols and applications. Constraints of cost and power consumptionmake it infeasible to equip each sensor node\nin the network with a global position system (GPS) unit, especially for large-scaleWSNs. A promisingmethod to localize unknown\nnodes is to use several mobile anchors which are equipped with GPS units moving among unknown nodes and periodically\nbroadcasting their current locations to help nearby unknown nodes with localization. This paper proposes amobile anchor assisted\nlocalization algorithm based on regular hexagon (MAALRH) in two-dimensional WSNs, which can cover the whole monitoring\narea with a boundary compensation method. Unknown nodes calculate their positions by using trilateration. We compare the\nMAALRH with HILBERT, CIRCLES, and S-CURVES algorithms in terms of localization ratio, localization accuracy, and path\nlength. Simulations show that the MAALRH can achieve high localization ratio and localization accuracy when the communication\nrange is not smaller than the trajectory resolution.
Loading....